Normalisation and subformula property for a system of classical logic with Tarski’s rule

This paper considers a formalisation of classical logic using general introduction rules and elimination rules. It proposes definition `maximal formula', `segment' segment' suitable to the system, gives reduction procedures for them. is then shown that deductions in system convert into normal form, i.e. contain neither maximal formulas nor segments, form satisfy subformula property. Tarski's Rule treated as rule implication. The negation has similar form. Maximal with implication or main operator require more intricate kind not present normalisation intuitionist logic. Correction added end corrects an error: Theorem 2 mistaken, so corollary drawn from it well was concluded by same mistake. Luckily this does affect result paper.